Accurate Numerical Fourier Transform in d-Dimensions
نویسندگان
چکیده
منابع مشابه
A new numerical Fourier transform in d-dimensions
The classical method of numerically computing Fourier transforms of digitized functions in one or in -dimensions is the so-called discrete Fourier transform (DFT) efficiently implemented as fast Fourier transform (FFT) algorithms. In many cases, the DFT is not an adequate approximation to the continuous Fourier transform, and because the DFT is periodical, spectrum aliasing may occur. The metho...
متن کاملAn efficient and high-order frequency-domain approach for transient acoustic–structure interactions in three dimensions
This paper is concerned with numerical solution of the transient acoustic–structure interaction problems in three dimensions. An efficient and higher-order method is proposed with a combination of the exponential window technique and a fast and accurate boundary integral equation solver in the frequency-domain. The exponential window applied to the acoustic–structure system yields an artificial...
متن کاملAn Accurate Discrete Fourier Transform for Image Processing
The classical method of numerically computing the Fourier transform of digitizedfunctions in one or in ddimensions is the so-called discrete Fourier transform ( D F T ) , efficiently implemented as Fast Fourier Transform ( F F T ) algorithms. In m n y cases the D F T is not an adequate appmximation of the continuous Fourier transform. The method presented in this contribution provides accurate ...
متن کاملFast, High-Order Methods for Scattering by Inhomogeneous Media
In this thesis, we introduce a new, fast, high-order method for scattering by inhomogeneous media in three dimensions. As in previously existing methods, the low (O(N logN)) complexity of our integral equation method is obtained through extensive use of the fast Fourier transform (FFT) in evaluating the required convolutions. Unlike previous FFT-based methods, however, this method yields high-o...
متن کاملAccuracy of the Discrete Fourier Transform and the Fast Fourier Transform
Fast Fourier transform (FFT)-based computations can be far more accurate than the slow transforms suggest. Discrete Fourier transforms computed through the FFT are far more accurate than slow transforms, and convolutions computed via FFT are far more accurate than the direct results. However, these results depend critically on the accuracy of the FFT software employed, which should generally be...
متن کامل